Single-cluster dynamics for the random-cluster model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-cluster dynamics for the random-cluster model.

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster deco...

متن کامل

Dynamics for the Mean-field Random-cluster Model

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and random spanning trees, but its dynamics have so far largely resisted analysis. In this work we study a natural non-local Markov chain known as the Chayes-Machta dynamics for the mean-field case of the random-cluster model, and identify a critical regime (λs, λS) of the model parameter λ ...

متن کامل

The Random-cluster Model

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the theory of certain random combinatorial structures, and of electrical networks. Much (but not all) of the physical theory of Ising/Potts models is best implement...

متن کامل

Random cluster dynamics for the Ising model is rapidly mixing

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at q = 2 is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model at any temperature has the same polynomial mixing time bound.

متن کامل

Single-Cluster Monte Carlo Dynamics for the Ising Model

We present an extensive study of a new Monte Carlo acceleration algorithm introduced by Wolff for the Ising model. It differs from the Swendsen-Wang algorithm by growing and flipping single clusters at a random seed. In general, it is more efficient than Swendsen-Wang dynamics for d > 2, giving zero critical slowing down in the upper critical dimension. Monte Carlo simulations give dynamical cr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2009

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.80.036707